Generalized pattern matching and periodicity under substring consistent equivalence relations
نویسندگان
چکیده
منابع مشابه
FUZZY SUBGROUPS AND CERTAIN EQUIVALENCE RELATIONS
In this paper, we study an equivalence relation on the set of fuzzysubgroups of an arbitrary group G and give four equivalent conditions each ofwhich characterizes this relation. We demonstrate that with this equivalencerelation each equivalence class constitutes a lattice under the ordering of fuzzy setinclusion. Moreover, we study the behavior of these equivalence classes under theaction of a...
متن کاملGeneralized Graph Pattern Matching
Graphs are high expressive models and especially suitable for modelling highly complex structures, the number of applications that use them for modelling both their data and the processes that manipulate has grown dramatically in recent years. The use of new conceptual structures in real-world applications requires the development of new systems to store and query such structures in order to al...
متن کاملGeneralized Substring Compression
In substring compression one is given a text to preprocess so that, upon request, a compressed substring is returned. Generalized substring compression is the same with the following twist. The queries contain an additional context substring (or a collection of context substrings) and the answers are the substring in compressed format, where the context substring is used to make the compression...
متن کاملReoptimization of the Closest Substring Problem under Pattern Length Modification
is study investigates whether reoptimization can help in solving the closest substring problem. We are dealing with the following reoptimization scenario. Suppose, we have an optimal llength closest substring of a given set of sequences S. How can this information be benecial in obtaining an (l + k)-length closest substring for S? In this study, we show that the problem is still computational...
متن کاملGeneralized closest substring encryption
We propose a new cryptographic notion called generalized closest substring encryption. In this notion, a ciphertext encrypted with a string S can be decrypted with a private key of another string S′, if there exist a substring of S, i.e. Ŝ, and a substring of S′, i.e. Ŝ′, that are “close” to each other measured by their “overlap distance”. The overlap distance between Ŝ and Ŝ′ is the number of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.02.017